#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
int n, r[MAXN];
int main(){
    freopen("duel.in", "r", stdin);
	freopen("duel.out", "w", stdout);
    scanf("%d", &n);
    for(int i = 1; i <= n; i++)scanf("%d", &r[i]);
    sort(r + 1, r + n + 1);
    int h = 1, t = 2, cnt = 0;
    while(t <= n)
        if(r[h] < r[t])cnt++, h++, t++;
        else t++;
    printf("%d", n - cnt);
}